1070H - BerOS File Suggestion - CodeForces Solution


brute force implementation *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define int long long 
using namespace std;
int n, q;
string s;
map<string, string> mp;
map<string, int> pos;
map<string, bool> vis;
signed main (){
	cin >> n;
	for (int i = 1; i <= n; ++i){
		cin >> s;
		vis.clear();
		for (int j = 0; j < s.size(); ++j){
			string sa = "";
			for (int k = j ; k < s.size(); ++k){
				sa += s[k];
				if (vis[sa]) continue;
				mp[sa] = s;
				++pos[sa];
				vis[sa] = 1;
			}
		}
	}
	cin >> q;
	while (q --){
		cin >> s;
		if (!mp.count(s)) cout << "0 -" << '\n';
		else cout << pos[s] << ' ' << mp[s] << '\n';
	} 
	return 0;
}
  	 		 		 	 	        			   	


Comments

Submit
0 Comments
More Questions

1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins